Exponential sums and the Carlitz-Uchiyama bound

نویسنده

  • Gilles Lachaud
چکیده

Gilles L a c h a u d 1 S u m m a r y I n t r o d u c t i o n 1. The equation Tq-T = a 2. The equation yq-y = f 3. The genus of coverings 4. Exponential sums and L functions 5. Bounds for traces of exponential sums, for n u m b e r of points of coverings, and for trace equations 6. Examples : coverings of the line 7. The Carlitz-Uchiyama bound for geometric BCH codes Bibliography Introduction

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exponential Sums and Goppa Codes: I

A bound is obtained which generalizes the Carlitz-Uchiyama result, based on a theorem of Bombieri and Weil about exponential sums. This new bound is used to estimate the covering radius of long binary Goppa codes. A new lower bound is also derived on the minimum distance of the dual of a binary Goppa code, similar to that for BCH codes. This is an example of the use of a number-theory bound for...

متن کامل

Lifts of Points on Curves and Exponential Sums

We give bounds for exponential sums over curves defined over Galois rings. We first define summation subsets as the images of lifts of points from affine opens of the reduced curve, and give bounds for the degrees of their coordinate functions. Then we get bounds for exponential sums, extending results of Kumar et al., Winnie Li over the projective line, and Voloch-Walker over elliptic curves a...

متن کامل

Almost Independent and Weakly Biased Arrays: Eecient Constructions and Cryptologic Applications

The best known constructions for arrays with low bias are those from 1] and the exponential sum method based on the Weil-Carlitz-Uchiyama bound. They all yield essentially the same parameters. We present new eecient coding-theoretic constructions, which allow far-reaching generalizations and improvements. The classical constructions can be described as making use of Reed-Solomon codes. Our recu...

متن کامل

A STICKLEBERGER THEOREM FOR p-ADIC GAUSS SUMS

Character sums over finite fields have been widely studied since Gauss. During the last decade, coding theorists initiated the study of a new type of sums, over points with coordinates in a p-adic field. Let O (u) m be the ring of integers of Q p(ζpm−1), the unramified extension of degree m of the field of p-adic numbers Q p obtained by adjoining the (p−1)-th roots of unity, Tm = T ∗ m∪{0}, whe...

متن کامل

On the duals of binary BCH codes

We give bounds for the minimal distance of duals of binary BCH codes in a range where the Carlitz-Uchiyama bound is trivial. This is done by estimating the number of points on certain curves over finite fields.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1988